Transformation of spectra of graph Laplacians
نویسندگان
چکیده
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولcompactifications and representations of transformation semigroups
this thesis deals essentially (but not from all aspects) with the extension of the notion of semigroup compactification and the construction of a general theory of semitopological nonaffine (affine) transformation semigroup compactifications. it determines those compactification which are universal with respect to some algebric or topological properties. as an application of the theory, it is i...
15 صفحه اولKernels of Directed Graph Laplacians
Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D − Q, sometimes referred to as the directed Laplacian. A classical result of Kirchhoff asserts that when G is undirected, the multiplicity of the eigenvalue 0 equals the number of connected components of G. This fact has a meaningful generalization to directed graphs, as was observ...
متن کاملEigenvalues of Transmission Graph Laplacians
The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a “transmission” system. A transmission system is a mathematical representation of a means of transmitting (multi-parameter) data along directed edges from vertex to vertex. The associated transmission graph Laplacian is shown to have many of the former properties of the classica...
متن کاملDuality and nonlinear graph Laplacians
We present an iterative algorithm for solving a class of nonlinear Laplacian system of equations in Õ(km log(kn/ǫ)) iterations, where k is a measure of nonlinearity, n is the number of variables, m is the number of nonzero entries in the graph Laplacian L, ǫ is the solution accuracy and Õ() neglects (non-leading) logarithmic terms. This algorithm is a natural nonlinear extension of the one by o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 2010
ISSN: 0035-7596
DOI: 10.1216/rmj-2010-40-6-2037